Probabilistic Queuing Scheme for Servicing E- Mails Using Markov Chains
نویسندگان
چکیده
Recently, huge number of e-mails is sent and received. These e-mails are classified into spam and non spam ones which are processed with the same priority. To guarantee a higher priority service to non-spam e-mails than that is provided to spam e-mails, a two-priority queue scheme was proposed. There are some drawbacks in the two-priority queue scheme such as it fails to provide a Quality of Service (QoS) in case of network bottlenecks. In this paper, an algorithm for servicing non-spam e-mails with high probability is proposed. Markov chain is used to analyze the servicing probability of e-mails in case of two and three priority queue schemes. Results proved that the three-queue scheme provides a higher probability service to the most important non spam e-mails than that is provided to the same class in case of the two-queue scheme.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملDistributed generation of Markov chains infinitesimal generator matrices for queuing network models
In this paper we want to present problems connected with the generation and storing of huge sparse matrices, arising during modelling the queuing networks with the use of Markov chains. We also want to present an algorithm for distributed generation of such matrices.
متن کاملUsing Markov chains for modelling networks
The paper contains the review and the discussion on modelling communication networks with the use of queuing models and Markov chains. It shows how to take into account various characteristics of real systems – like some control mechanisms and the traffic self-similarity. There are presented two mechanisms modelled with Markov chains: the RED algorithm in TCP/IP and a self-similar traffic shaping.
متن کاملA New Heuristic Statistical Methodology for Optimizing Queuing Networks Using Discreet Event Simulation
Most of the real queuing systems include special properties and constraints, which can not be analyzed directly by using the results of solved classical queuing models. Lack of Markov chains features, unexponential patterns and service constraints, are the mentioned conditions. This paper represents an applied general algorithm for analysis and optimizing the queuing systems. The algorithm stag...
متن کامل